Predicate Classes

نویسنده

  • Craig Chambers
چکیده

Predicate classes are a new linguistic construct designed to complement normal classes in objectoriented languages. Like a normal class, a predicate class has a set of superclasses, methods, and instance variables. However, unlike a normal class, an object is automatically an instance of a predicate class whenever it satisfies a predicate expression associated with the predicate class. The predicate expression can test the value or state of the object, thus supporting a form of implicit property-based classification that augments the explicit type-based classification provided by normal classes. By associating methods with predicate classes, method lookup can depend not only on the dynamic class of an argument but also on its dynamic value or state. If an object is modified, the property-based classification of an object can change over time, implementing shifts in major behavior modes of the object. A version of predicate classes has been designed and implemented in the context of the Cecil language.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Predicate Classes and Promise Classes

3 8 8 f ?g ? ? predicate classes promise classes Bernd Borchert Universität Heidelberg predicate classes promise function promise classes

متن کامل

Predicate Dispatching: A Unified Theory of Dispatch

Predicate dispatching generalizes previous method dispatch mechanisms by permitting arbitrary predicates to control method applicability and by using logical implication between predicates as the overriding relationship. The method selected to handle a message send can depend not just on the classes of the arguments, as in ordinary object-oriented dispatch, but also on the classes of subcompone...

متن کامل

Predicate Dispatching: a Uniied Theory of Dispatch

Predicate dispatching generalizes previous method dispatch mechanisms by permitting arbitrary predicates to control method applicability and by using logical implication between predicates as the overriding relationship. The method selected to handle a message send can depend not just on the classes of the arguments, as in ordinary object-oriented dispatch, but also on the classes of subcompone...

متن کامل

The Stable Models of a Predicate Logic Program

Gelfond-Lifschitz [7] introduced the concept of a stable model M of a Predicate Logic Program P . Here we show that, up to a recursive 1-1 coding, the set of all stable models of finite Predicate Logic Programs and the Π1 classes (equivalently, the set of all infinite branches of recursive trees) coincide (Theorems 4.1 and 5.1). Typical consequences: 1) there are finite Predicate Logic Programs...

متن کامل

On the Relationship between Description Logic-based and F-Logic-based Ontologies

Many popular ontology languages are based on (subsets of) first-order predicate logic, with classes represented by unary predicates and properties by binary predicates. Specifically, the Semantic Web ontology language OWL DL is based on the Description Logic SHOIN . F-Logic is an ontology language which is also based on first-order logic, but classes and properties are modeled as terms rather t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993